The Size of the Largest Components in Random Planar Maps
نویسندگان
چکیده
Bender, Richmond, and Wormald showed that in almost all planar 3-connected triangulations (or dually, 3-connected cubic maps) with n edges, the largest 4-connected triangulation (or dually, the largest cyclically 4-edge-connected cubic component) has about n/2 edges [Random Structures Algorithms, 7 (1995), pp. 273–285]. In this paper, we derive some general results about the size of the largest component and apply them to a variety of types of planar maps.
منابع مشابه
Graph classes with given 3-connected components: Asymptotic enumeration and random graphs
Consider a family T of 3-connected graphs of moderate growth, and let G be the class of graphs whose 3-connected components are graphs in T . We present a general framework for analyzing such graphs classes based on singularity analysis of generating functions, which generalizes previously studied cases such as planar graphs and series-parallel graphs. We provide a general result for the asympt...
متن کاملSome Sharp Concentration Results about Random Planar Triangulations
The theory of random maps has a relatively short history compared with the theory of random graphs. In this talk, we mention some recent sharp concentration results about random planar triangulations such as the maximum vertex degree, the largest component, the number of copies of a given submap, and the number of ippable edges.
متن کاملRandom planar graphs and beyond
We survey several results on the enumeration of planar graphs and on properties of random planar graphs. This includes basic parameters, such as the number of edges and the number of connected components, and extremal parameters such as the size of the largest component, the diameter and the maximum degree. We discuss extensions to graphs on surfaces and to classes of graphs closed under minors...
متن کاملRigid Components of Random Graphs
The planar rigidity problem asks, given a set of m pairwise distances among a set P of n unknown points, whether it is possible to reconstruct P , up to a finite set of possibilities (modulo rigid motions of the plane). The celebrated Maxwell-Laman Theorem from Rigidity Theory says that, generically, the rigidity problem has a combinatorial answer: the underlying combinatorial structure must co...
متن کاملEstimation of Maximum Inclusion Size and Fatigue Limit in HSLA-100 Steel
The objective of the current study is to determine the fatigue limit of a clean and high-performance material named as HSLA-100 steel and to compare the obtained fatigue limit with that of theoretically predicted fatigue limit by statistics of extreme value (SEV) method. Also, the size of inclusions located at the site of fatigue crack nucleation on the fracture surface of the fatigue test spec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 12 شماره
صفحات -
تاریخ انتشار 1999